Cyclical parthenogenesis algorithm for layout optimization of truss structures with frequency constraints

Structural optimization with frequency constraints is seen as a challenging problem because it is associated with highly nonlinear, discontinuous and non-convex search spaces consisting of several local optima. Therefore, competent optimization algorithms are essential for addressing these problems. In this article, a newly developed metaheuristic method called the cyclical parthenogenesis algorithm (CPA) is used for layout optimization of truss structures subjected to frequency constraints. CPA is a nature-inspired, population-based metaheuristic algorithm, which imitates the reproductive and social behaviour of some animal species such as aphids, which alternate between sexual and asexual reproduction. The efficiency of the CPA is validated using four numerical examples.     

Dynamic phase balancing in the smart distribution networks

A distribution system might be unbalanced due to various reasons which can cause some major problems. Re-phasing strategy is the most effective method for phase balancing performed manually in distribution networks. Dynamic phase balancing is the main objective of this paper that means re-phasing performance at any time of day when unbalance is more than permissible limit. It is possible only in smart distribution networks by installing the automatic re-phasing switches at busbars. Automatic re-phasing eliminates the customer service interruption cost and labour cost available in the manual re-phasing operation. There are two basic operations in the optimal dynamic phase balancing: detecting the best time for re-phasing and considering the load variations in real distribution networks. This paper consists of two scenarios. First scenario is switches installation at all nodes of feeder and second scenario is switches installation at the limited strategic nodes. First scenario focuses on search space reduction by employing a sensitivity analysis method which improves the convergence along with time saving. In order to solve the proposed optimization problem, the modified shuffled frog leaping algorithm (MSFLA) is implemented. Simulation studies greatly demonstrate the benefits achieved from this operation by reducing power loss cost and improving network phase balancing.     

Arm motion analysis using genetic algorithm for rehabilitation and healthcare

The worlds population is quickly aging. With an aging society, an increase in patients with brain damage is predicted. In rehabilitation, the analysis of arm motion is vital as various day to day activities relate to arm movements. The therapeutic approach and evaluation method are generally selected by therapists based on his/her experience, which can be an issue for quantitative evaluation in any specific movement task. In this paper, we develop a measurement system for arm motion analysis using a 3D image sensor. The method of upper body posture estimation based on a steady-state genetic algorithm (SSGA) is proposed. A continuous model of generation for an adaptive search in dynamical environment using an adaptive penalty function and island model is applied. Experimental results indicate promising results as compared with the literature.     

On the polynomial solvability of distributionally robust k-sum optimization

In this paper, we define a distributionally robust k-sum optimization problem as the problem of finding a solution that minimizes the worst-case expected sum of up to the k largest costs of the elements in the solution. The costs are random with a joint probability distribution that is not completely specified but rather assumed to be known to lie in a set of probability distributions. For k=1, this reduces to a distributionally robust bottleneck optimization problem while for k=n, this reduces to distributionally robust minimum sum optimization problem. Our main result is that for a Fréchet class of discrete marginal distributions with finite support, the distributionally robust k-sum combinatorial optimization problem is solvable in polynomial time if the deterministic minimum sum problem is solvable in polynomial time. This extends the result of Punnen and Aneja [On k-sum optimization, Oper. Res. Lett. 18(5)(1996), pp. 233–236] from the deterministic to the robust case. We show that this choice of the set of distributions helps preserve the submodularity of the k-sum objective function which is an useful structural property for optimization problems.     

Combined heat and power economic dispatch using integrated civilized swarm optimization and Powell’s pattern search method

An integrated technique that embeds civilized swarm optimization (CSO) and Powell’s pattern search (PPS) method is proposed to search economic dispatch of combined heat and power (CHP) dispatch problem. In the proposed technique, CSO is selected as global search technique and PPS is undertaken as a local search technique. Civilized swarm optimization is having attributes of particle swarm optimization (PSO) and society civilization algorithm (SCA). In CSO, mutually interacting societies forms the civilization. The positions of society particles are updated through the guidance of own leader along with their best positions. The best performing particle of CSO is further improved by PPS method based on a certain set criterion. The PPS method is based on the conjugate search direction method and does not require the gradient or Hessian matrix of the function to be optimized. The CHP dispatch problem has a mutual dependency of demand and heat-power capacity of generating units, so it requires an effective constraint handling strategy. In this work, variable reduction strategy with exterior penalty method is applied to satisfy equality constraints. The proposed technique is tested on five CHP test systems considering valve-point loading effect, prohibited operating zones constraint, and transmission losses. The obtained results are compared to the results reported in the literature and found satisfactory. Further, for verification of statistical performance of the proposed technique, t-test and Wilcoxon signed rank test is also performed.     

Robust production planning and control for multi-stage systems with flexible final assembly lines

Production planning of final assembly systems is a challenging task, as the often fluctuating order volumes require flexible solutions. Besides, the calculated plans need to be robust against the process-level disturbances and stochastic nature of some parameters like manual processing times or machine availability. In the paper, a simulation-based optimisation method is proposed that utilises lower level shop floor data to calculate robust production plans for final assembly lines of a flexible, multi-stage production system. In order to minimise the idle times when executing the plans, the capacity control that specifies the proper operator–task assignments is also determined. The analysed multi-stage system is operated with a pull strategy, which means that the production at the final assembly lines generates demands for the preceding stages providing the assembled components. In order to guarantee the feasibility of the plans calculated for the final assembly lines, a decomposition approach is proposed to optimise the production plan of preceding stages. By this way, the robust production can be ensured resulting in reduced losses and overall production costs even though the system is exposed to changes and disturbances.     

Blood supply chain network design considering blood group compatibility under uncertainty

This paper addresses the design of a blood supply chain (SC) network considering blood group compatibility. To this aim, a bi-objective mathematical programming model is developed which minimises the total cost as well as the maximum unsatisfied demand. Due to uncertain nature of some input parameters, two novel robust possibilistic programming models are proposed based on credibility measure. The data of a real case study are then used to illustrate the applicability and performance of the proposed models as well as validating the proposed robust possibilistic programming approach. The obtained results show the superiority of the developed models and significant cost savings compared to current existed blood SC network.     

Fault diagnosis of rolling bearings using a genetic algorithm optimized neural network

In rotary complex machines, collapse of a component may inexplicably occur usually accompanied by a noise or a disturbance emanating from other sources. Rolling bearings constitute a vital part in many rotational machines and the vibration generated by a faulty bearing easily affects the neighboring components. Continuous monitoring, fault diagnosis and predictive maintenance, is a crucial task to reduce the degree of damage and stopping time for a rotating machine. Analysis of fault-related vibration signal is a usual method for accurate diagnosis. Among the resonant demodulation techniques, a well-known resolution often used for fault diagnosis is envelope analysis. But, usually this method may not be adequate enough to indicate satisfactory results. It may require some auxiliary additional techniques. This study suggests some methods to extract features using envelope analysis accompanied by Hilbert Transform and Fast Fourier Transform. The proposed artificial neural network (ANN) based fault estimation algorithm was verified with experimental tests and promising results. Every test was initiated with a reference ANN architecture to avoid inappropriate classification during the evaluation of fitness value. Later, ANN model was modified using a genetic algorithm providing, an optimal skillful fast-reacting network architecture with improved classification results.     

A simple solution method for the blade element momentum equations with guaranteed convergence

The blade element momentum (BEM) equations, though conceptually simple, can be challenging to solve reliably and efficiently with high precision. These requirements are particularly important for efficient rotor blade optimization that utilizes gradient‐based algorithms. Many solution approaches exist for numerically converging the axial and tangential induction factors. These methods all generally suffer from a lack of robustness in some regions of the rotor blade design space, or require significantly increased complexity to promote convergence. The approach described here allows for the BEM equations to be parameterized by one variable—the local inflow angle. This reduction is mathematically equivalent, but greatly simplifies the solution approach. Namely, it allows for the use of one‐dimensional root‐finding algorithms for which very robust and efficient algorithms exist. This paper also discusses an appropriate arrangement of the equation and corresponding bounds for the one‐dimensional search—intervals that bracket the solution and over which the function is well behaved. The result is a methodology for solving the BEM equations with guaranteed convergence and at a superlinear rate.Copyright © 2013 John Wiley & Sons, Ltd.     

Extracting TSK-type Neuro-Fuzzy model using the Hunting search algorithm

This paper proposes a Takagi-Sugeno-Kang (TSK) type Neuro-Fuzzy model tuned by a novel metaheuristic optimization algorithm called Hunting Search (HuS). The HuS algorithm is derived based on a model of group hunting of animals such as lions, wolves, and dolphins when looking for a prey. In this study, the structure and parameters of the fuzzy model are encoded into a particle. Thus, the optimal structure and parameters are achieved simultaneously. The proposed method was demonstrated through modeling and control problems, and the results have been compared with other optimization techniques. The comparisons indicate that the proposed method represents a powerful search approach and an effective optimization technique as it can extract the accurate TSK fuzzy model with an appropriate number of rules.